Distributed minimum spanning tree
part 12/12 · 19.6 KB total
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────
cite-note-55. ↑ David Peleg and Vitaly Rubinovich “A near tight lower bound on the time complexity of Distributed Minimum Spanning Tree Construction,“ SIAM Journal on Computing, 2000, and IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
cite-note-lynch-66. ↑ Nancy A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
cite-note-khan-77. ↑ Maleq Khan and Gopal Pandurangan. "A Fast Distributed Approximation Algorithm for Minimum Spanning Trees,"" Distributed Computing, vol. 20, no. 6, pp. 391–402, Apr. 2008.
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────